Finite representation of commutator sequences

نویسندگان

چکیده

Several structural properties of an algebraic structure can be seen from the higher commutators its congruences. Even on a finite algebra, sequence commutator operations is infinite object. In this paper, we exhibit representations for algebras congruence modular varieties.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Power-commutator Presentations for Infinite Sequences Of

For certain infinite sequences of 3-groups G with derived length 2 ≤ dl(G) ≤ 3, and either with G/G′ ' (3, 3), coclass cc(G) ≥ 1, or with G/G′ ' (9, 3), coclass cc(G) ≥ 3, parametrized pc-presentations are given in dependence on the class c = cl(G).

متن کامل

The Jacobsthal Sequences in Finite Groups

Abstract In this paper, we study the generalized order- Jacobsthal sequences modulo for and the generalized order-k Jacobsthal-Padovan sequence modulo for . Also, we define the generalized order-k Jacobsthal orbit of a k-generator group for and the generalized order-k Jacobsthal-Padovan orbit a k-generator group for . Furthermore, we obtain the lengths of the periods of the generalized order-3 ...

متن کامل

Succinct Representation of Sequences⋆

Given a sequence S = s1s2 . . . sn such that 1 ≤ sq ≤ r for all q, where r = O(polylog(n)), we show how S can be represented using nH0(S)+ o(n) bits (where H0(S) is the zero-order entropy of S), so that we can know any sq, as well as answer rank and select queries on S, in constant time. This extends previous results on binary sequences, and improves previous results on general sequences where ...

متن کامل

Trace Representation of Legendre Sequences

In this paper, a Legendre sequence of period p for any odd prime p is explicitely represented as a sum of trace functions from G F(2n) to G F(2), where n is the order of 2 mod p.

متن کامل

Quadtree Representation of DNA Sequences

Quadtree representation is a method representing a frequency distribution of all oligo nucleotides in long DNA sequences. The method is theoretically equivalent to chaos game representation [2, 3], which represents orbits of the chaos game system (or iterated function system [1]) driven by the DNA sequences. Since the relation between a point in the orbit and a subsequence in the driving DNA se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Algebra and Computation

سال: 2022

ISSN: ['0218-1967', '1793-6500']

DOI: https://doi.org/10.1142/s0218196722500680